Representing Policies for Quantified Boolean Formulas
نویسندگان
چکیده
The practical use of Quantified Boolean Formulas (QBFs) often calls for more than solving the validity problem QBF. For this reason we investigate the corresponding function problems whose expected outputs are policies. QBFs which do not evaluate to true do not have any solution policy, but can be of interest nevertheless; for handling them, we introduce a notion of partial policy. We focus on the representation of policies, considering QBFs of the form ∀X ∃Y Φ. Because the explicit representation of policies for such QBFs can be of exponential size, descriptions as compact as possible must be looked for. To address this issue, two approaches based on the decomposition and the compilation of Φ are presented.
منابع مشابه
Function problems for Quantified Boolean Formulas
The practical use of Quantified Boolean Formulas (QBFs) often calls for more than solving the evaluation problem QBF. For this reason we investigate the corresponding function problem FQBF. We define expected outputs of FQBF instances as solution policies. We focus on the representation of policies, considering QBFs of the form ∀X ∃Y Φ. Because the explicit representation of policies for such Q...
متن کاملEncoding Nested Boolean Functions as Quantified Boolean Formulas
In this paper, we consider the problem of compactly representing nested instantiations of propositional subformulas with different arguments as quantified Boolean formulas (QBF). We develop a generic QBF encoding pattern which combines and generalizes existing QBF encoding techniques for simpler types of redundancy. We obtain an equivalence-preserving transformation in linear time from the PSPA...
متن کاملParaconsistent Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories
Through minimal-model semantics, three-valued logics provide an interesting formalism for capturing reasoning from inconsistent information. However, the resulting paraconsistent logics lack so far a uniform implementation platform. Here, we address this and specifically provide a translation of two such paraconsistent logics into the language of quantified Boolean formulas (QBFs). These formul...
متن کاملRepresenting Policies for Quantified Boolean Formulae
The practical use of Quantified Boolean Formulae (QBFs) often calls for more than solving the validity problem QBF. For this reason we investigate the corresponding function problems whose expected outputs are policies. QBFs which do not evaluate to true do not have any solution policy, but can be of interest nevertheless; for handling them, we introduce a notion of partial policy. We focus on ...
متن کاملRepresenting Paraconsistent Reasoning via Quantified Propositional Logic
Quantified propositional logic is an extension of classical propositional logic where quantifications over atomic formulas are permitted. As such, quantified propositional logic is a fragment of secondorder logic, and its sentences are usually referred to as quantified Boolean formulas (QBFs). The motivation to study quantified propositional logic for paraconsistent reasoning is based on two fu...
متن کامل